Fast and Accurate Closest Point Search on Triangulated Surfaces and its Application to Head Motion Estimation

نویسنده

  • DENNIS MAIER
چکیده

The Iterative Closest Point (ICP) algorithm is widely used to register two roughly aligned surfaces. Its most expensive step is the search for the closest point. Many efficient variants have been proposed to speed up this step, however they do not guarantee that the closest point on a triangulated surface is found. Instead they might result in an approximation of the closest point. In this paper we present a method for the closest point search that is fast and exact. The method was implemented and used to evaluate the accuracy of head motion estimation using dense 3D data obtained from a stereo camera system. The results show that the accuracy of the estimated head motion is better than 1 mm for translational movements and better than 1 degree for rotations. Key-Words: Iterative Closest Point, 3D Registration, Stereo, Head Motion Estimation

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Adaptive search area for fast motion estimation

In this paper a new method for determining the search area for motion estimation algorithm based on block matching is suggested. In the proposed method the search area is adaptively found for each block of a frame. This search area is similar to that of the full search (FS) algorithm but smaller for most blocks of a frame. Therefore, the proposed algorithm is analogous to FS in terms of reg...

متن کامل

Optimization of Fast Block Motion Estimation Algorithms - Circuits and Systems for Video Technology, IEEE Transactions on

There are basically three approaches for carrying out fast block motion estimation: 1) fast search by a reduction of motion vector candidates; 2) fast block-matching distortion (BMD) computation; and 3) motion field subsampling. The first approach has been studied more extensively since different ways of reducing motion vector candidates may result in significantly different performance; while ...

متن کامل

A Rapid Optimization Method for Slip Surface in Earth Slopes Using Genetic Algorithm

This paper introduces an accurate, fast, and applicable method for optimization of slip surfaces in earth slopes. Using Genetic Algorithm (GA), which is one of the modern and non-classic optimization methods, in conjunction with the well -known Bishop applied method, the optimum slip surface in an earth slope is investigated and its corresponding lowest safety factor is determined. Investigati...

متن کامل

Performance Analysis of Iterative Closest Point (ICP) Algorithm using Modified Hausdorff Distance

1School of Electronics Engineering, VIT University, Vellore, India 2Assistant Professor (Selection Grade), VIT University, Vellore, India ---------------------------------------------------------------------***--------------------------------------------------------------------Abstract Registration, tracking and reconstruction of 3-D models in real time has many applications in the fields of po...

متن کامل

A Rapid Optimization Method for Slip Surface in Earth Slopes Using Genetic Algorithm

This paper introduces an accurate, fast, and applicable method for optimization of slip surfaces in earth slopes. Using Genetic Algorithm (GA), which is one of the modern and non-classic optimization methods, in conjunction with the&#10well -known Bishop applied method, the optimum slip surface in an earth slope is investigated and its corresponding lowest safety factor is determined. Investiga...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003